Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem
نویسندگان
چکیده
We consider the Minimum Interference Frequency Assignment Problem and we propose a novel Simulated Annealing approach that makes use of portfolio different neighborhoods, specifically designed for this problem. undertake at once two versions problem proposed by Correia (2001) Montemanni et al. (2001), respectively, corresponding benchmark instances. With aim determining best configuration solver specific version perform comprehensive statistically-principled tuning procedure. Even tough totally precise comparison is not possible, experimental analysis show outperform all previous results on most instances first problem, are same level ones second version. As byproduct research, new robust file format solutions, data repository validating maintaining available solutions.
منابع مشابه
Variable Neighborhood Search for the Minimum Interference Frequency Assignment Problem
The frequency assignment is an important task in the design of radio network. Let us concider a GSM network N composed of a set of nc cells: C= {C1, C2 . . . Ci, . . . Cnc}. Each cell required a number of frequencies which is defined by the number of transceivers TRX or traffic demand Di= {1, 2 . . . , x}An interval of operational frequencies: [Fmax − Fmin]. Further, consider a matrix: MCo[nc][...
متن کاملMulti-start simulated annealing for dynamic plant layout problem
In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...
متن کاملA Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is one of the well-known combinatorial optimization problems and is known for its various applications. In this paper, we propose a modified simulated annealing algorithm for the QAP – M-SA-QAP. The novelty of the proposed algorithm is an advanced formula of calculation of the initial and final temperatures, as well as an original cooling schedule with osc...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO journal on computational optimization
سال: 2022
ISSN: ['2192-4406', '2192-4414']
DOI: https://doi.org/10.1016/j.ejco.2021.100024